Studies on the Convergence Speed of Over-Sampled Subband Adaptive Digital Filters
نویسندگان
چکیده
To evaluate or compare the convergence speed of adaptive digital filters (ADF) with least mean squared (LMS) algorithm, the condition numbers of correlation matrices of tapinput vectors are often used. In this paper, however, the comparison of the conventional fullband ADF and the subband ADF based on their condition numbers is shown to be invalid. In some cases, the over-sampled subband ADF converges faster than the fullband ADF, although the former has larger condition numbers. To explain the above phenomenon, an expression for the convergence behavior of the subband ADF and simulation results are provided. key words: LMS algorithm, subband ADF, convergence speed
منابع مشابه
A Family of Variable Step-Size Normalized Subband Adaptive Filter Algorithms Using Statistics of System Impulse Response
This paper presents a new variable step-size normalized subband adaptive filter (VSS-NSAF) algorithm. The proposed algorithm uses the prior knowledge of the system impulse response statistics and the optimal step-size vector is obtained by minimizing the mean-square deviation(MSD). In comparison with NSAF, the VSS-NSAF algorithm has faster convergence speed and lower MSD. To reduce the computa...
متن کاملDynamic structures for non-uniform subband adaptive filtering
Subband adaptive filters suffer degraded performance when high input energy occurs at frequencies coincident with subband boundaries. This is seen as increased error in critically sampled systems and as reduced asymptotic convergence speed in oversampled systems. To address this problem a dynamic frequency decomposition scheme is presented which aims to control the frequency of subband boundari...
متن کاملConvergence improvement for oversampled subband adaptive noise and echo cancellation
The convergence rate of the Least Mean Square (LMS) algorithm is dependent on the eigenvalue distribution of the reference input correlation matrix. When adaptive filters are employed in low-delay over-sampled subband structures, colored subband signals considerably decelerate the convergence speed. Here, we propose and implement two promising techniques for improving the convergence rate based...
متن کاملAffine projection algorithm for oversampled subband adaptive filters
The performance of the Normalized Least Mean Square (NLMS) algorithm for adaptive filtering is dependent on the spectral flatness of the reference input. Thus, the standard NLMS algorithm does not perform well in Over-Sampled Subband Adaptive Filters (OS-SAFs) because colored subband signals are generated even for white input signals. Thus we propose the use of the Affine Projection Algorithm (...
متن کاملSubband Blind Source Separation with Critically Sampled Filter Banks
Subband blind source separation methods have been recently proposed with the objective of reducing the computational complexity and improving the convergence rate of online adaptive algorithms. Oversampled subband structures, employing uniform DFT filter banks, are usually employed in order to avoid aliasing effects and keep enough samples to estimate the statistics of the subband signals. In t...
متن کامل